DRAFT : IEEE TRANSACTIONS ON COMPUTER - AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS , 2001 1 Pseudo Pin Assignment with Crosstalk
نویسنده
چکیده
| This paper presents a new pseudo pin assignment (PPA) algorithm with crosstalk noise control in multi-layer gridless general-area routing. We propose a two-step approach that considers obstacles and minimizes the weighted sum of total wire length and the estimated number of vias under crosstalk noise constraints. We test our algorithms on a set of MCM examples and a set of standard cell examples. Without crosstalk noise control in PPA, the average noise in the MCM test cases after detailed routing is 0:13-0:22 V DD with up to 11% of nets larger than 0:3 V DD. However, if the noise constraint of each net is set to 0:3 V DD in PPA, the average noise in each case reduces to 0:11-0:15 V DD (15%-31% reduction) with no crosstalk noise violations. Most of the nets in our standard cell test cases do not have noise problems. Our PPA algorithms still give better noise distributions and have 1%-10% noise reduction on the global nets in these standard cell test cases. Even without rip-up and reroute, the detailed routing completion rate is 93%-99% and the average vias per net is only 0:7-1:4 for our MCM test cases and 1:0-1:7 for our standard cell test cases.
منابع مشابه
Pseudopin Assignment with Crosstalk Noise Control - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
This paper presents a new pseudopin assignment (PPA) algorithm with crosstalk noise control in multilayer gridless general-area routing. We propose a two-step approach that considers obstacles and minimizes the weighted sum of total wire length and the estimated number of vias under crosstalk noise constraints. We test our algorithms on a set of MCM examples and a set of standard-cell examples....
متن کاملCOP: A Crosstalk OPtimizer for Gridded Channel Routing - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
The interwire spacing in a VLSI chip becomes closer as the VLSI fabrication technology rapidly evolves. Accordingly, it becomes important to consider crosstalk caused by the coupling capacitance between adjacent wires in the layout design for the fast and safe VLSI circuits. The upper bounds of the allowable crosstalk for nets, called crosstalk constraints, are usually given in the design speci...
متن کاملPin assignment with global routing for general cell designs
In this paper, we present an algorithm which combines the pin assignment step and the global routing step in the physical design of VLSI circuits. Our algorithm is based on two key theorems: the channel pin assignment theorem and the block boundary decomposition theorem. These two theorems enable us to deal successfully with the high complexity resulting from combining the pin assignment and gl...
متن کاملPlanar Topological Routing - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
We develop a simple linear time algorithm to determine if a collection of two-pin nets can be routed, topologically, in a plane (i.e., single layer). Experiments indicate that this algorithm is faster than the linear time algorithm of Marek-Sadowska and Tarng. Topological routability testing of a collection of multipin nets is shown to be equivalent to planarity testing, and a simple linear tim...
متن کاملMachine Learning Attacks on PolyPUF, OB-PUF, RPUF, and PUF-FSM
A physically unclonable function (PUF) is a circuit of which the input– output behavior is designed to be sensitive to the random variations of its manufacturing process. This building block hence facilitates the authentication of any given device in a population of identically laid-out silicon chips, similar to the biometric authentication of a human. The focus and novelty of this work is the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001